An Optimal Parallel Algorithm For the All Nearest -- Neighbor Problem for a Convex Polygon
نویسنده
چکیده
In this paper we give a parallel algorithm for finding the nearest-neighbor vertex of each vertex of a convex polygon. Our algoritb..z::J. runs in O(log n) time using O(njlogn) processors, in the parallel computation model CREW PRA.lvr (ConcurrentRead, Exclusive-Write Parallel RAM). This implies that the all nearest-neighbors problem for a convex polygon can be solved in O(n/p+logn) time using p processors, which is optimal.
منابع مشابه
Non-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملTime-Optimal Nearest-Neighbor Computations on Enhanced Meshes
The All-Nearest Neighbor problem (ANN, for short) is stated as follows: given a set S of points in the plane, determine for every point in S, a point that lies closest to it. The ANN problem is central to VLSI design, computer graphics, pattern recognition, and image processing, among others. In this paper we propose time-optimal algorithms to solve the ANN problem for an arbitrary set of point...
متن کاملTime-optimal Proximity Graph Computations on Enhanced Meshes
In pattern recognition, morphology, and cellular system design one is interested in objects routinely represented by a polygon P. Distance properties among the vertices of P are one of the fundamental descriptors useful in shape analysis and clustering. In order to capture perceptually relevant features of P one associates a variety of proximity graphs with the polygon P. Typically such a proxi...
متن کاملOptimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values
The all nearest smaller values problem is deened as follows. Let A = (a 1 ; a 2 ; : : :; a n) be n elements drawn from a totally ordered domain. For each a i , 1 i n, nd the two nearest elements in A that are smaller than a i (if such exist): the left nearest smaller element a j (with j < i) and the right nearest smaller element a k (with k > i). We give an O(loglog n) time optimal parallel alg...
متن کامل